A Smart Approximation Algorithm for Minimum Vertex Cover Problem based on Min-to-Min (MtM) Strategy
نویسندگان
چکیده
منابع مشابه
Improved Approximation for Min-Sum Vertex Cover
The paper describes an approximation algorithm for the Min Sum Vertex Cover (MSVC) problem, achieving a constant approximation factor strictly smaller than 2, thus improving on the best currently known approximation algorithm for the problem. ∗Department of Computer Science and Applied Mathematics, The Weizmann Institute of Science, Rehovot 76100, Israel. E-mail: [email protected]. †Depar...
متن کاملOn the max min vertex cover Problem
We address the max min vertex cover problem, which is the maximization version of the well studied min independent dominating set problem, known to be NP-hard and highly inapproximable in polynomial time. We present tight approximation results for this problem on general graphs, namely a polynomial approximation algorithm which guarantees an n approximation ratio, while showing that unless P = ...
متن کاملResults on the min-sum vertex cover problem
Let G be a graph with the vertex set V (G), edge set E(G). A vertex labeling is a bijection f : V (G)→ {1, 2, . . . , |V (G)|}. The weight of e = uv ∈ E(G) is given by g(e) = min{f(u), f(v)}. The min-sum vertex cover (msvc) is a vertex labeling that minimizes the vertex cover number μs(G) = ∑ e∈E(G) g(e). The minimum such sum is called the msvc cost. In this paper, we give both general bounds a...
متن کاملTowards Understanding the Min-Sum Message Passing Algorithm for the Minimum Weighted Vertex Cover Problem: An Analytical Approach
Given a vertex-weighted undirected graph G = 〈V,E,w〉, the minimum weighted vertex cover (MWVC) problem is to find a subset of vertices with minimum total weight such that every edge in the graph has at least one of its endpoints in it. The MWVC problem and its amenability to the min-sum message passing (MSMP) algorithm remain understudied despite the common occurrence of the MWVC problem and th...
متن کاملThe Limits of Tractability: MIN-VERTEX-COVER
Today, we are talking about the MIN-VERTEX-COVER problem. MIN-VERTEX-COVER is a classic NP-hard optimization problem, and to solve it, we need to compromise. We look at three approaches. First, we consider restricting our attention to a special case: a (binary) tree. Then, we look at an exponential algorithm parameterized by the size of the vertex cover. Finally, we look at approximation algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2020
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2020.0111232